Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
911	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
912	Scheduling with Group Dynamics: a Multi-Robot Task Allocation Algorithm based on Vacancy Chains Torbjørn S. Dahl, Maja J. Matari´ c, and Gaurav S. Sukhatme tdahl\|mataric\| Add to Reading List Source URL: cres.usc.edu Language: English - Date: 2007-04-28 17:21:28 Mathematics Science Scheduling Theoretical computer science Robotics Job shop scheduling Computational complexity theory Robot Algorithm Operations research Applied mathematics Mathematical optimization
913	A Communication Lower Bounds Using Directional Derivatives ALEXANDER A. SHERSTOV, University of California, Los Angeles We study the set disjointness problem in the most powerful model of bounded-error communication, the Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2014-06-25 14:31:55 Quantum complexity theory Multiparty communication complexity Communication complexity PP Forcing Circuit complexity Theoretical computer science Applied mathematics Computational complexity theory
914	Call for Papers Computational Complexity Twenty-third Annual IEEE Conference http://computationalcomplexity.org June 23–26, 2008 Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:09:08 Competitions Digital media Grants Research Academic publishing Electronic Colloquium on Computational Complexity Electronic submission Complexity Computational complexity theory Knowledge Academia Science
915	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
916	The non-adaptive query complexity of testing k-parities Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-07-24 10:17:39 Computational complexity theory Quantum information science Communication Communication complexity Quantum complexity theory Parity function Entropy Circuit complexity Decision tree model Theoretical computer science Applied mathematics Mathematics
917	Matrix-Vector Multiplication in Sub-Quadratic Time (Some Preprocessing Required) Ryan Williams∗ Abstract We show that any n × n matrix A over any finite semiring can be preprocessed in O(n2+ε ) Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2006-10-02 16:50:12 Matrices Matrix theory Computational complexity theory Digital signal processing Fast Fourier transform Adjacency matrix Matrix multiplication Shortest path problem Semiring Mathematics Algebra Abstract algebra
918	A Exponential Lower Bounds for AC0 -Frege Imply Superpolynomial Frege Lower Bounds YUVAL FILMUS and TONIANN PITASSI, University of Toronto RAHUL SANTHANAM, University of Edinburgh Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-05 15:13:04 Computational complexity theory Logic in computer science Mathematical logic Proof theory Automated theorem proving Frege system Proof complexity Function Switching lemma Theoretical computer science Mathematics Logic
919	An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2002-08-27 12:28:51 Pseudorandomness Pseudorandom number generators Computational complexity theory Algorithmic information theory Pseudorandom generator Hard-core predicate XTR One-way function Naor-Reingold Pseudorandom Function Theoretical computer science Cryptography Applied mathematics
920	On Explaining Integer Vectors by Few Homogenous Segments Robert Bredereck? , Jiehua Chen?? , Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Ondˇrej Such´ y? ? ? Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-07 04:32:27 Abstract algebra Linear algebra NP-complete problems Computational complexity theory Vectors Parameterized complexity Kernelization FO Parameter Algebra Mathematics Theoretical computer science

UPDATE